tree = {
    'node1': {
        'children': [
            {
                'node2': {
                    'children': [
                        {
                            'node4': {
                                'children': []
                            }
                        },
                        {
                            'node5': {
                                'children': []
                            }
                        }
                    ]
                }
            },
            {
                'node3': {
                    'children': [
                        {
                            'node6': {
                                'children': []
                            }
                        }
                    ]
                }
            }
        ]
    }
}


def traverse_tree(node):
    """
    遍历树形结构并打印每个节点信息
    
    Args:
        node (dict): 包含树形结构信息的字典，至少包含 'children' 键值对，'children' 对应的值为一个列表，列表中的元素为子节点的字典
    
    Returns:
        None
    """
    if 'children' in node:
        for child in node['children']:
            traverse_tree(child)
    print(node)

traverse_tree(tree['node1'])